Parallel implementation of simulated annealing by distributed memory systems

نویسندگان

  • A. Consiglio
  • A. Genco
  • A. Pecorella
  • G. Pecorellâ
چکیده

The aim of this paper is to provide a parallel strategy to be used when implementing the Simulated Annealing process by distributed memory systems. It focuses the attention on the portfolio selection problem with dynamic and integer constraints on the variables. However, this method can be extended to any dynamic optimisation problem as the optimal control. In the first part it develops the sequential algorithm of Simulated Annealing stressing some features inherent in the application itself: the structure of the neighbourhood of the solution, the starting value and the decreasing schedule of the control parameter. In the second part it deals with the formulation of a parallel strategy for the algorithm. It starts from the consideration that an optimisation technique with a probabilistic searching criterion cannot give a reliable result in a single execution. Therefore it proposes a strategy performing a number of independent concurrent Simulated Annealing processes applied to different initial configurations of the same problem. Finally, it proposes a co-operation policy among processes, by means of a reduced number of communications. This policy enhance the efficiency of the parallel computing system. INTRODUCTION Investment diversification is known as the best way to reduce the intrinsic risk of individual financial assets. Transactions on Information and Communications Technologies vol 3, © 1993 WIT Press, www.witpress.com, ISSN 1743-3517

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Problem Independent Distributed Simulated Annealing and its Applications

Simulated annealing has proven to be a good technique for solving hard combinatorial optimization problems. Some attempts at speeding up annealing algorithms have been based on shared memory multiprocessor systems. Also parallelizations for certain problems on distributed memory multiprocessor systems are known. In this paper, we present a problem independent general purpose parallel implementa...

متن کامل

Simulated Annealing and its Applications

Simulated annealing has proven to be a good technique for solving hard combina-torial optimization problems. Some attempts at speeding up annealing algorithms have been based on shared memory multiprocessor systems. Also parallelizations for certain problems on distributed memory multiprocessor systems are known. In this paper, we present a problem independent general purpose parallel implement...

متن کامل

Implementation Models for Distributed Memory Architecture of Parallel Simulated Annealing Using Genetic Crossover

This paper examines implementation models for distributed memory architectures of a Parallel Simulated Annealing using Genetic Crossover (PSA/GAc). The PSA/GAc that was proposed by authors is the algorithm, where there are several processes of a simulated annealing working parallel. To exchange information between the solutions, the operation of genetic crossover is performed. We need new model...

متن کامل

N-ary Speculative Computation of Simulated Annealing on the AP1000 Massively Parallel Multiprocessor

Simulated annealing is known to be an efficient method for combinatorial optimization problems. Its usage for realistic problem size, however, has been limited by the long execution time due to its sequential nature. This report presents a practical approach to synchronous simulated annealing for massively parallel distributed-memory multiprocessors. We use an n-ary speculative tree to execute ...

متن کامل

A New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters

In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004